Efficient independent set approximation in unit disk graphs
نویسندگان
چکیده
منابع مشابه
Faster Approximation for Maximum Independent Set on Unit Disk Graph
Maximum independent set from a given set D of unit disks intersecting a horizontal line can be solved in O(n) time and O(n) space. As a corollary, we design a factor 2 approximation algorithm for the maximum independent set problem on unit disk graph which takes both time and space of O(n). The best known factor 2 approximation algorithm for this problem runs in O(n logn) time and takes O(n) sp...
متن کاملApproximation Algorithms for Maximum Independent Set Problems and Fractional Coloring Problems on Unit Disk Graphs
Unit disk graphs are the intersection graphs of equal sized circles in the plane. In this paper, we consider the maximum independent set problems on unit disk graphs. When the given unit disk graph is de ned on a slab whose width is k, we propose an algorithm for nding a maximum independent set in O(n 4 d 2k= p 3 e ) time where n denotes the number of vertices. We also propose a (1 1=r)-approxi...
متن کاملDistributed Approximation Algorithms in Unit-Disk Graphs
We will give distributed approximation schemes for the maximum matching problem and the minimum connected dominating set problem in unit-disk graphs. The algorithms are deterministic, run in a poly-logarithmic number of rounds in the message passing model and the approximation error can be made O(1/ log |G|) where |G| is the order of the graph and k is a positive integer.
متن کاملApproximation Algorithms for Unit Disk Graphs
Mobile ad hoc networks are frequently modeled by unit disk graphs. We consider several classical graph theoretic problems on unit disk graphs (Maximum Independent Set, Minimum Vertex Cover, and Minimum (Connected) Dominating Set), which are relevant to such networks. We propose two new notions for unit disk graphs: thickness and density. The thickness of a graph is the number of disk centers in...
متن کاملA (4 + ǫ)-Approximation for the Minimum-Weight Dominating Set Problem in Unit Disk Graphs
We present a (4 + ǫ)-approximation algorithm for the problem of computing a minimum-weight dominating set in unit disk graphs, where ǫ is an arbitrarily small constant. The previous best known approximation ratio was 5+ǫ. The main result of this paper is a 4-approximation algorithm for the problem restricted to constant-size areas. To obtain the (4 + ǫ)-approximation algorithm for the unrestric...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Applied Mathematics
سال: 2020
ISSN: 0166-218X
DOI: 10.1016/j.dam.2018.05.049